Delay-insensitive pipelined communication on parallel buses
نویسندگان
چکیده
منابع مشابه
Delay-Insensitive Pipelined Communicatioon on Parallel Buses
Abstruct-Cons:ler a communication channel that consists of several subchannels transmitting simultaneously and asynchronously. As an example of this scheme, we can consider a board with several chips. The subchannels represent wires connecting between the chips where differences in the lengths of the wires might result in asynchronous reception. In current technology, the receiver acknowledges ...
متن کاملParallel-Pipelined Radix-6 Multipath Delay Commutator FFT Architectures
The new Proposed design has been designed and developed by novel parallel-pipelined Fast Fourier Transform (FFT) architecture. The most important and fastest efficient algorithm is a FFT. FFT is used to computes the Discrete Fourier Transform (DFT). FFT is mainly applied in autocorrelation, spectrum analysis, linear filtering and pattern recognition system. The proposed architectures were desig...
متن کاملCoding for delay-insensitive communication with partial synchronization
C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423, July 1948. P. A. Franaszek, “Sequence-state coding for digital transmission,” Bell Syst. Tech. J., vol. 47, pp. 143-157, Jan. 1968. G. F. M. Beenker and K. A. Schouhamer Immink, “A generalized method for encoding and decoding run-length-limited binary sequences,” IEEE Trans. Inform. Theory, vol. ...
متن کاملPipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube
This paper brings together a number of previously known techniques in order toobtain practical and e cient \pipelined" implementations of the pre x operation forthe complete binary tree, hypercube, and shu e-exchange families of networks. In eachcase, we provide a scheme for performing k pre x operations in O(k + lg p) time on pprocessors. The same bounds are shown to apply ...
متن کاملFast and Scalable Parallel Algorithms for Matrix Chain Product and Matrix Powers on Reconfigurable Pipelined Optical Buses
Given N matrices A1, A2, ..., AN of size N × N, the matrix chain product problem is to compute A1 × A2 × ...× AN. Given an N × N matrix A, the matrix powers problem is to calculate the first N powers of A, i.e., A, A, A, ..., A. Both problems are important in conducting many matrix manipulations such as computing the characteristic polynomial, determinant, rank, and inverse of a matrix, and in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1995
ISSN: 0018-9340
DOI: 10.1109/12.381951